See semiconnected on Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "semi",
"3": "connected"
},
"expansion": "semi- + connected",
"name": "pre"
}
],
"etymology_text": "semi- + connected",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "semiconnected (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English terms prefixed with semi-",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"Containing a directed path from u to v or a directed path from v to u for every pair of vertices u, v."
],
"id": "en-semiconnected-en-adj-zZfoZIyl",
"links": [
[
"graph theory",
"graph theory"
],
[
"directed path",
"directed path"
],
[
"pair",
"pair"
],
[
"vertices",
"vertex"
]
],
"raw_glosses": [
"(graph theory) Containing a directed path from u to v or a directed path from v to u for every pair of vertices u, v."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "semiconnected"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "semi",
"3": "connected"
},
"expansion": "semi- + connected",
"name": "pre"
}
],
"etymology_text": "semi- + connected",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "semiconnected (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms prefixed with semi-",
"English uncomparable adjectives",
"Pages with 1 entry",
"Pages with entries",
"en:Graph theory"
],
"glosses": [
"Containing a directed path from u to v or a directed path from v to u for every pair of vertices u, v."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"directed path",
"directed path"
],
[
"pair",
"pair"
],
[
"vertices",
"vertex"
]
],
"raw_glosses": [
"(graph theory) Containing a directed path from u to v or a directed path from v to u for every pair of vertices u, v."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "semiconnected"
}
Download raw JSONL data for semiconnected meaning in All languages combined (1.0kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.